Complementing Incomplete Edge Profile by applying Minimum Cost Circulation Algorithms
نویسندگان
چکیده
................................................................................................................................. V List of Tables ............................................................................................................................. VII List of Figures ........................................................................................................................... VIII
منابع مشابه
Advanced Topics in Algorithms
[1] David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, and Moti Yung. Corrigendum: Maintenance of a minimum spanning forest in a dynamic plane graph. J. Algorithms, 15(1), 1993. [2] Andrew V. Goldberg and Robert E. Tarjan. Finding minimum-cost circulations by successive approximation. Math. Oper. Res., 15(3):430–466, July 1990. [3] Jacob Holm, Kristi...
متن کاملImage Segmentation with Minimum Mean Cut
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of ‘mean cut’ cost functions. Minimizing these cost functions corresponds to finding a cut with minimummean edge weight in a connected planar graph. This approach has several advantages over prior approaches to image segmentation. First, it allows cuts with both open and closed boundaries. Second...
متن کاملPoly - Logarithmic Deterministic Fully - Dynamic GraphAlgorithms I : Connectivity and Minimum Spanning Tree
Deterministic fully dynamic graph algorithms are presented for con-nectivity and minimum spanning forest. For connectivity, starting with no edges, the amortized cost for maintaining a spanning forest is O(log 2 n) per update, i.e. per edge insertion or deletion. Deciding connectivity between any two given vertices is done in O(log n= log log n) time. This matches the previous best randomized b...
متن کاملThe edge tenacity of a split graph
The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...
متن کاملA Fixed-parameter algorithms for minimum cost edge-connectivity augmentation
We consider connectivity-augmentation problems in a setting where each potential new edge has a nonnegative cost associated with it, and the task is to achieve a certain connectivity target with at most p new edges of minimum total cost. The main result is that the minimum cost augmentation of edge-connectivity from k − 1 to k with at most p new edges is fixed-parameter tractable parameterized ...
متن کامل